A problem of Klee on inner section functions of convex bodies
نویسندگان
چکیده
منابع مشابه
A Problem of Klee on Inner Section Functions of Convex Bodies
In 1969, Vic Klee asked whether a convex body is uniquely determined (up to translation and reflection in the origin) by its inner section function, the function giving for each direction the maximal area of sections of the body by hyperplanes orthogonal to that direction. We answer this question in the negative by constructing two infinitely smooth convex bodies of revolution about the xn-axis...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
a contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
The Cross-section Body, Plane Sections of Convex Bodies and Approximation of Convex Bodies, Ii*
We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, those of sections of convex bodies and of sections of their circumscribed cylinders. For L ⊂ R a convex body, we take n random segments in L and consider their ‘Minkowski average’ D. For fixed n, the pth moments of V (D) (1 ≤ p < ∞) are minimized, for V (L) fixed, by the ell...
متن کاملChasing Convex Bodies and Functions
We consider three related online problems: Online Convex Optimization, Convex Body Chasing, and Lazy Convex Body Chasing. In Online Convex Optimization the input is an online sequence of convex functions over some Euclidean space. In response to a function, the online algorithm can move to any destination point in the Euclidean space. The cost is the total distance moved plus the sum of the fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Geometry
سال: 2012
ISSN: 0022-040X
DOI: 10.4310/jdg/1344430824